Resolving the Topological Social Choice Paradox
نویسندگان
چکیده
1.1. Topological Social Choice Theory. Social choice theory aims to understand the nature of, and provide methods for, the aggregation of individual preferences to yield a social preference which is fair and satisfactory to individual voters on an axiomatic ground. An important example of this is in popular elections. In the 1980s, Chichilnisky and colleagues developed a topological approach pioneered by Eckmann in the 1950s in [2] to model this situation. Here, the space of preferences may be modeled as a parafinite CW complex. These constitute a very large collection of spaces whose topology is very well-understood, and for example includes all manifolds (among many other classes of examples). In this framework, Chichilnisky and Heal proved in [1] (following Eckmann in [2]) a topological analogue of Arrow’s result, known as the Resolution Theorem. It was shown that contractibility of P , a very strong topological condition, is necessary and sufficient for there to exist a social aggregation rule P → P which is continuous and respects anonymity and unanimity (called a Chichilnisky map). The contractibility restriction is central to the topological theory of social aggregation, so we will explore and interpret contractibility in this context. The main idea is that it is impossible for a non-contractible preference spaces to have a tied (inconclusive) vote. The Resolution Theorem may be viewed as requiring that no ties are possible, where the definition of “tie” depends on the context. In particular, every possible preference profile has an aggregated social outcome.
منابع مشابه
Topological aggregation, the twin paradox and the no show paradox
Consider the framework of topological aggregation introduced by Chichilnisky (1980). We prove that in this framework the Twin Paradox and the No Show Paradox cannot be avoided. Anonymity and unanimity are not needed to obtain these results.
متن کاملTopological Social Choice Topological Social Choice
The topological approach to social choice was developed by Graciela Chichilnisky in the beginning of the eighties. The main result in this area (known as the resolution of the topological social choice paradox) shows that a space of preferences admits of a continuous, anonymous, and unanimous aggregation rule for every number of individuals if and only if the space is contractible. Furthermore,...
متن کاملOn the topological equivalence of the Arrow impossibility theorem and Amartya Sen's liberal paradox
We will show that the Arrow impossibility theorem for binary social choice rules that there exists no binary social choice rule which satisfies transitivity, Pareto principle, independence of irrelevant alternatives (IIA), and has no dictator, and Amartya Sen’s liberal paradox for binary social choice rules that there exists no binary social choice rule which satisfies acyclicity, Pareto princi...
متن کاملTopological social choice
The topological approach to social choice was developed by Graciela Chichilnisky in the beginning of the 1980s. The main result in this area (known as the resolution of the topological social choice paradox) shows that a space of preferences admits of a continuous, anonymous, and unanimous aggregation rule for every number of individuals if and only if this space is contractible. Furthermore, c...
متن کاملResolving the Ellsberg Paradox by Assuming that People Evaluate Repetitive Sampling
Ellsberg (1961) designed a decision experiment where most people violated the axioms of rational choice. He asked people to bet on the outcome of certain random events with known and with unknown probabilities. They usually preferred to bet on events with known probabilities. It is shown that this behavior is reasonable and in accordance with the axioms of rational decision making if it is assu...
متن کامل